Modified Needleman–Wunsch algorithm for clinical pathway clustering
نویسندگان
چکیده
Clinical pathways are used to guide clinicians provide a standardised delivery of care. Because their standardisation, the aim clinical is reduce variation in both care process and patient outcomes. When learning from data through mining, it common practice represent each pathway as string corresponding movements activities. Clustering techniques popular methods for therefore this paper focuses on distance metrics applied k-medoids clustering. The two main aims firstly, develop technique that seamlessly integrates expert information with secondly, metric purpose data. overall goal was allow more meaningful clustering results be found by adding context into similarity calculation. Eight applicability discussed. These prove give an arbitrary distance, without consideration context, produce different results. As result, describes development new metric, modified Needleman–Wunsch algorithm, allows interaction calculation assigning groupings rankings activities, which strings. This algorithm has been developed partnership UK’s National Health Service (NHS) focus lung cancer pathway, however handling application any disease type. method contained within Sim.Pro.Flow, publicly available decision support tool.
منابع مشابه
Modified K-Means Algorithm for Genetic Clustering
The K-Means Clustering Approach is one of main algorithms in the literature of Pattern recognition and Machine Learning. Yet, due to the random selection of cluster centers and the adherence of results to initial cluster centers, the risk of trapping into local optimality ever exists. In this paper, inspired by a genetic algorithm which is based on the K-means method , a new approach is develop...
متن کاملA modified genetic algorithm for feature clustering
A new genetic algorithm (GA) based on feature clustering with an energy function is proposed for obtaining optimal segmentation. In the proposed algorithm, which we call the modified genetic algorithm (MGA), the length of each genome is the number of features and each individual (genome) represents one assignment of the input-features to labels. The energy function, which is used as a fitness f...
متن کاملAn Optimization K-Modes Clustering Algorithm with Elephant Herding Optimization Algorithm for Crime Clustering
The detection and prevention of crime, in the past few decades, required several years of research and analysis. However, today, thanks to smart systems based on data mining techniques, it is possible to detect and prevent crime in a considerably less time. Classification and clustering-based smart techniques can classify and cluster the crime-related samples. The most important factor in the c...
متن کاملA Hybrid Data Clustering Algorithm Using Modified Krill Herd Algorithm and K-MEANS
Data clustering is the process of partitioning a set of data objects into meaning clusters or groups. Due to the vast usage of clustering algorithms in many fields, a lot of research is still going on to find the best and efficient clustering algorithm. K-means is simple and easy to implement, but it suffers from initialization of cluster center and hence trapped in local optimum. In this paper...
متن کاملInnovative Modified K-Mode Clustering Algorithm
The K-Mode algorithm is known for applications on categorical datasets but with few drawbacks like selecting random k value, efficiency on cluster accuracy and so on. This paper provides research study on extension and modification of K-mode algorithm to provide good initial starting mean to get better clusters with better accuracy results on categorical data domains. The proposed algorithm has...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Biomedical Informatics
سال: 2021
ISSN: ['1532-0480', '1532-0464']
DOI: https://doi.org/10.1016/j.jbi.2020.103668